Maximum-take-precedence ACELP: a low complexity search method
نویسندگان
چکیده
The ACELP method makes use of multipulse structure to represent the excitation pulses of residual signal. With the purpose of computational complexity reduction, this paper provides the Maximum-TakePrecedence ACELP (MTP-ACELP) search method under the acceptable degradation in performance. Because the maximum of target signal is preferentially compensated, the degradation of performance would be diminished. By predicting the locations of pulses, the computational complexity would be reduced. We not only reduce the possible pulse combinations in search procedure but also avoid the computation of useless correlation functions before the search procedure. Furthermore, the proposed method is compatible to any ACELP type vocoder, e.g. the G.723.1, G.729, GSMEFR standards.
منابع مشابه
Efficient Codebook Search Method for Acelp Speech Codecs
Speech codecs with ACELP structure are widely used due to their high performance for the bit rates between 4kbps and 16kbps. In ACELP codecs, search for the best codevector from a huge codebook is the crucial pan in both performance and complexity. In most cases, non-optimal search method is used in order to reduce the search load with minimal performance degradation. However, its complexity is...
متن کاملA Fast ACELP Codebook Search Method Based on Pulse Replacement and Tree Pruning
The algebraic code excited linear prediction (ACELP) algorithm has been adopted by many speech coding standards, due to low complexity and high quality in its analysis-by-synthesis optimization. One of the optimum ACELP codebook search methods is depth first tree search. Two methods based on pulse replacement and pruning of tree are already proposed for improvement the depth first tree search m...
متن کاملAmr to G.729a Speech Transcoding with Fast Codebook Search
Speech transcoding scheme is needed in the voice system over internet. Full decoding technique is an intuitive and traditional speech transcoding method, but it requires high computational complexity and long processing time. In this paper, we propose a partial decoding technique with fast codebook search, which utilizes the pulse replacement method, on ACELP coding architecture. There is no ne...
متن کاملAn efficient algebraic codebook search for ACELP speech coder
In a bid to enhance the search performance, this paper presents an improved version of reduced candidate mechanism (RCM), an algebraic codebook search conducted on an algebraic code-excited linear prediction (ACELP) speech coder. This improvement is made based on two findings in a piece of our prior work. The first finding is that a pulse with a high contribution in the associated track is more...
متن کاملA Cuckoo search algorithm (CSA) for Precedence Constrained Sequencing Problem (PCSP)
Precedence constrained sequencing problem (PCSP) is related to locate the optimal sequence with the shortest traveling time among all feasible sequences. In PCSP, precedence relations determine sequence of traveling between any two nodes. Various methods and algorithms for effectively solving the PCSP have been suggested. In this paper we propose a cuckoo search algorithm (CSA) for effectively ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001